منابع مشابه
A Note On Covering and Partition of A Finite Set
In this short communication, an extremal combinatorial problem concerning partition and covering of a finite set is discussed. It is pointed out that unlike the case with partition, no closed formula solution for determining the total number of coverings is known. Some motivating steps are indicated. The application of compatibility relation to solve some minimization problem is outlined.
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملA Covering Theorem with Applications
We prove a Covering Theorem that allows us to prove modified norm inequalities for general maximal operators. We will also give applications to convergence of a sequence of linear operators and the differentiation of the integral.
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملSet Covering Problems
Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from Steiner triple systems and the larger problem, which has a constraint matrix of size 330 × 45 has only recently been solved. In this note, we show that the Steiner triple systems do indeed give rise to a series of problems that are probably hard to solve by implicit enumera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1972
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s000497270004421x